perm filename BIO.COR[NOT,DBL] blob
sn#196179 filedate 1976-01-13 generic text, type C, neo UTF8
COMMENT ā VALID 00003 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 Name: Douglas B. Lenat
C00006 00003 Publications
C00011 ENDMK
Cā;
Name: Douglas B. Lenat
Home Address: 1C Escondido Village, Stanford U., Stanford, Ca. 94305
Phone: 415-329-1031
Born: September 13, 1950, Philadelphia, Pennsylvania
Degrees conferred:
B.A. Mathematics; U. of Pa., 6/72
B.A. Physics; U. of Pa., 6/72
M.S. Applied Mathematics; U. of Pa., 6/72
Honors/awards/committees:
1970 President of Pi Mu Epsilon (undergraduate math honor society)
1971 Finance committee of the U. of Pa.
1972 Elected to membership in Sigma Xi
1975 Stanford A.I. Qual Exam committee
1975 Stanford Computer Science Curriculum committee
Expected degree:
Ph.D. Computer Science; Stanford U., 8/76
Thesis adviser and committee:
C. Cordell Green, E. A. Feigenbaum, D. E. Knuth, B. Buchanan
Thesis topic: "The Automated Mathematician"
Investigations of creative theory formation in empirical science have
led to the construction of AM, a heuristic search program which can
do simple mathematical research. AM examines empirical data,
proposes plausible conjectures, formulates new definitions, and
judges the worth of each new concept. AM's guiding heuristics are
used as a rudimentary calculus to evaluate "interestingness".
Currently, AM is given prenumerical knowledge, and makes forays into
arithmetic and elementary number theory.
Other investigations:
1970: Electron-electron scattering (as a research assistant to Professor
Walter Selove, an experimental high-energy physicist at U. of Pa.)
1971: Acoustic holography in air at 40mHz. (Physics senior thesis)
1972: Computer-generated holograms of 3D projections of 4-dimensional
objects, and reconstruction by normal laser imaging.
1973: Simple automatic programming systems PW1, SEW, PUP.
Described in Green et. al., below.
1974: PUP6: an automatic programming system capable of generating
one particular 10-page long LISP concept formation program,
from very constrained English dialogues.
Described in IJCAI75, and in IRIA symposium, below.
Publications
With others:
Green, Waldinger, Barstow, Elschlager, Lenat, McCune, Shaw, and Steinberg.
Progress Report on Program-Understanding Systems, Memo AIM-240,
CS Report STAN-CS-74-444, Artificial Intelligence Laboratory,
Stanford University, August, 1974.
By myself:
Synthesis of Large Programs from Specific Dialogues, Proceedings of the
International Symposium on Proving and Improving Programs, Le
Chesnay, France, sponsored by IRIA, July, 1975.
Duplication of Human Actions by an Interacting Community of Knowledge
Modules, Proceedings of the Third International Congress of
Cybernetics and Systems, Bucharest, Roumania, August, 1975.
BEINGS: Knowledge as Interacting Experts, Proceedings of the Fourth
International Joint Conference on Artificial Intelligence,
Tbilisi, Georgia, USSR, September, 1975.
Professional societies:
Association for Computing Machinery, SIGART,
Mathematical Association of America, Pi Mu Epsilon,
AAAS,
American Physical Society,
Sigma Xi
Pertinent employment:
Statistical programmer, Beaver College Psych. dept., parttime 1966-1969.
Programmer: M&T Co., Phila., parttime 1969-1970: constructed a simple
natural language understanding system (subcontracted for U.S.Navy).
Research assistant, Physics Dept., U. of Pa., summers 1970-1972.
Instructor for Math 110, U. of Pa., Spring semester 1972.
Technical Areas of interest
My first reaction at this category was to proclaim my broad interests
in many subfields of Artificial Intelligence, of Science in general.
I realize that what is wanted is a statement of those areas which I
intend to do research in or teach. My research has slowly evolved from
Informal Automatic Programming, to Representation of Knowledge in such
systems, to Representation of knowledge for theory formation, to the
analysis and emulation of theory formation in empirical science.
I believe myself competent to teach advanced seminars in:
Automatic programming, theory formation, heuristic search, structured
programming, representation of knowledge, and mechanical theorem-proving.
Career goals: I enjoy research, and desire an academic or industrial position
where at least half of my time was allocated to doing my own research.
I would enjoy spending the other time "communicating" with others --
via teaching, advising, working on group research projects, on
committees, by writing articles, by reviewing, etc.